Parallel LAN/WAN heuristics for optimization
نویسندگان
چکیده
منابع مشابه
Parallel LAN/WAN Heuristics for Optimization
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics (both pure and hybrid) for solving optimization problems. We focus on several evolutionary algorithms as well as on simulated annealing. Our goal is to offer a first study on the possible changes in the search mechanics that the algorithms suffer when shifting from a LAN network to a WAN environm...
متن کاملParallel Meta-heuristics Parallel Meta-heuristics
We present a state-of-the-art survey of parallel meta-heuristic strategies, developments, and results. We discuss general design and implementation principles that apply to most metaheuristic classes and instantiate these principles for neighborhood and population-based metaheuristics. We also identify a number of trends and promising research directions.
متن کاملParallel Strategies for Meta-heuristics
We present a state-of-the-art survey of parallel meta-heuristic developments and results, discuss general design and implementation principles that apply to most meta-heuristic classes, instantiate these principles for the three meta-heuristic classes currently most extensively used—genetic methods, simulated annealing, and tabu search, and identify a number of trends and promising research dir...
متن کاملHEURISTICS FOR COMBINATORIAL OPTIMIZATION Lecture 3 Metaheuristics for Construction Heuristics
Task: Pack all the items into a minimum number of unit-capacity bins An algorithm A is said to be a δ-approximation algorithm if it runs in polynomial time and for every problem instance π with optimal solution value OP T (π) minimization: A(π) OP T (π) ≤ δ δ ≥ 1 maximization: A(π) OP T (π) ≥ δ δ ≤ 1 A family of approximation algorithms for a problem Π, {A } , is called a polynomial approximati...
متن کاملStructural Heuristics For Query Optimization
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach to join-query optimization is cost based, which requires developing a cost model, assigning an estimated cost to each query-processing plan, and searching in the space of all plans for a plan of minimal cost. But as th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2004
ISSN: 0167-8191
DOI: 10.1016/j.parco.2003.12.007